小样产品试织时常见问题处理的探讨

本文结合多年的实践经验，针对纺织专业学生使用江阴通源生产的SGA598型半自动织样机设计试织时，出现的松紧边、锁边问题、张力控制等常见问题进行了探讨。     

Maximizing lifetime in wireless sensor networks with multiple sensor families

Wireless sensor networks are generally composed of a large number of hardware devices of the same type, deployed over a region of interest in order to perform a monitoring activity on a set of target points. Nowadays, several different types of sensor devices exist, which are able to monitor different aspects of the region of interest (including sound, vibrations, proximity, chemical contaminants, among others) and may be deployed together in a heterogeneous network. In this work, we face the problem of maximizing the amount of time during which such a network can remain operational, while maintaining at all times a minimum coverage guarantee for all the different sensor types. Some global regularity conditions in order to guarantee a fair level of coverage for each sensor type to each target are also taken into account in a second variant of the proposed problem. For both problem variants we developed an exact approach, which is based on a column generation algorithm whose subproblem is either solved heuristically by means of a genetic algorithm or optimally by an appropriate ILP formulation. In our computational tests the proposed genetic algorithm is shown to be able to dramatically speed up the procedure, enabling the resolution of large-scale instances within reasonable computational times.     

Two-Dimensional Problem of a Crack in Thermoelectric Materials

The two-dimensional problem of a crack in thermoelectric materials is studied in this research. The general solution is derived based on the complex variable method. For the case of a crack subjected to remote electric current and heat flow, the solutions are obtained in closed-form. The results show that the fields of heat flow, electric current, and stress exhibit traditional square-root singularity at the crack tip. The remote electric current produces both type I and II stress intensity factor. Furthermore, the stress intensity factor has a linear relationship with the heat flux, but a non-linear relationship with the electric current.     

Parallelized neural network system for solving Euclidean traveling salesman problem

We investigate a parallelized divide-and-conquer approach based on a self-organizing map (SOM) in order to solve the Euclidean traveling salesman problem (TSP). Our approach consists of dividing cities into municipalities, evolving the most appropriate solution from each municipality so as to find the best overall solution and, finally, joining neighborhood municipalities by using a blend operator to identify the final solution. We evaluate performance of parallelized approach over standard TSP test problems (TSPLIB) to show that our approach gives a better answer in terms of quality and time rather than the sequential evolutionary SOM.     

Dynamic facility layout problem in footwear industry

Dynamic facility layout problem (DFLP) deals with the arrangement of machines in a site as to minimize the sum of materials handling and re-layout costs by considering multi periods. The DFLP studies in the literature provide several different algorithms and utilize the well known test problems to assess their performance. However, real life applications are overlooked. The industries such as footwear and clothing are prone to seasonal demand changes. Therefore, time horizons and layout/re-layout of the machines within the facility should be studied carefully. This study considers a footwear facility and several scenarios are generated by using the real life data. A clonal selection based algorithm is proposed to solve the real life DFLP. The performance of the algorithm, further the effect of time periods on solution quality and applicability of the results are tested and promising results are obtained.     

求解鞍点问题的广义正定和反Hermitian分裂方法

探讨了如何求解大型稀疏鞍点问题,给出了一种基于正定分裂的广义正定和反Hermitian分裂(GPSS)方法。该方法首先利用矩阵的正定分裂,构造出鞍点矩阵的2种分裂格式;然后利用这2种分裂格式构造出GPSS迭代;接着给出了迭代收敛的充要条件。最后进行了数值对比实验,实验结果表明,GPSS比正定和反Hermitian分裂(PSS)和Hermitian和反Hermitian分裂(HSS)方法更有效。     

航班恢复问题的迭代局部搜索算法

在恶劣天气和机械故障等原因造成航班不能按照原计划执行时，航空公司需要采取相应的措施对航班进行恢复。本文基于经典的资源指派模型，综合考虑了调整时间、换机、联程拉直、取消航班和调机5种恢复策略，提出一种以最小化加权成本为优化目标的航班恢复模型，并设计一种迭代局部搜索算法。首先用构造-修复启发式方法构造可行解，然后从该初始解出发，在飞机路线对的邻域中进行局部搜索。当陷入局部最优后，对解进行扰动，然后从扰动后的解重新出发进行局部搜索。为了提高搜索效率，同时降低陷入局部最优解的概率，局部搜索过程采用模拟退火算法。实例结果表明，本文提出的模型及算法能够在短时间内对受到影响的大规模航班计划进行恢复。     

An efficient numerical scheme for solving fractional infinite-horizon optimal control problems

This paper presents an efficient numerical method to solve fractional infinite-horizon optimal control problems, where the dynamic control system depends on Caputo fractional derivatives. First, by a suitable change of variable, we transform the fractional infinite-horizon optimal control problem to a finite-horizon one. Then, with the help of an approximation, we replace the Caputo derivative to integer order derivative. According to the Pontryagin minimum principle (PMP) for optimal control problems and by constructing an error function, we define an unconstrained minimization problem. In the optimization problem, we use trial solutions for state, costate and control functions where these trial solutions are constructed by using two-layered perceptron neural network. Some numerical results are introduced to explain our main results.     

求解带时间窗车辆路径问题的改进型烟花算法

针对带时间窗车辆路径问题,为寻求组合优化问题最优解,构建总运输成本最小数学模型。由于烟花算法搜索半径不能自适应调整,算法后期易陷入局部最优,故对爆炸算子进行改进,使最优烟花搜索半径自适应调整,增强后期局部搜索能力;同时利用分布式信息共享机制避免算法早熟并引入变异火花增强种群多样性。利用标准测试集进行验证后,结果表明该算法在求解带时间窗车辆路径问题时不仅具有可行性和有效性,并且收敛速度快、搜索质量高。     

Designing a closed-loop supply chain network for citrus fruits crates considering environmental and economic issues

Most cities, notably major and agricultural ones, are faced with environmental and waste problems. Distribution and collection of agricultural crops can be challenging duties as world demand and production are substantially increased. Accordingly, resource depletion, environmental concern, and the importance of the circular economy have convinced this research group to focus on a Closed-Loop Supply Chain (CLSC) network design. In this study, a new mixed linear mathematical model for a CLSC was developed which minimizes the CLSC’s total costs and which tackles and controls air pollution. Contrary to previous works about supply chain network design, we firstly consider citrus fruits’ crates in our model. To solve the model, two leading algorithms, Genetic Algorithm and Simulated Annealing, are employed and a third recently successful method, Keshtel Algorithm, is utilized. Further, two hybridization algorithms stemmed from mentioned ones are applied. Finally, the results are assessed by different criteria and compared, and then the two best algorithms are chosen in this case. Consequently, in order to achieve the most effective result, a real case study of crates was conducted. The results obviously presented applicability and efficiency of the proposed model. Thus, the most suitable network for CLSC of citrus fruits’ crates was designed in which the costs and emissions were reduced.